Efficient Processing of XML Tree Pattern Queries
نویسندگان
چکیده
In this paper, we present a polynomial-time algorithm for TPQ (tree pattern queries) minimization without XML constraints involved. The main idea of the algorithm is a dynamic programming strategy to find all the matching subtrees within a TPQ. A matching subtree implies a redundancy and should be removed in such a way that the semantics of the original TPQ is not damaged. Our algorithm consists of two parts: one for subtree recognization and the other for subtree deletion. Both of them needs only O(n2) time, where n is the number of nodes in a TPQ.
منابع مشابه
Twig Pattern Matching Algorithms for XML
The emergence of XML promised significant advances in B2B integration. This is because users can store or transmit structure data using this highly flexible open standard. An effective well-formed XML document structure helps convert data into useful information that can be processed quickly and efficiently. From this point there is need for efficient processing of queries on XML data in XML da...
متن کاملEfficiency of TreeMatch Algorithm in XML Tree Pattern Matching
In Recent days exchange XML data more often in organizations and business sectors, so there is an increasing need for effective and efficient processing of queries on XML data. This paper presents a wide analysis to identify the efficiency of XML tree pattern matching algorithms. Previous years many methods have been proposed to match XML tree queries efficiently. In particularly TwigStack, Ord...
متن کاملChecking Satisfiability of Tree Pattern Queries for Active XML Documents
Satisfiability is an important problem of queries for XML documents. This paper focuses on the satisfiability of tree pattern queries for Active XML(AXML for short) documents conforming to a given AXML schema. An AXML document is an XML document where some data is given explicitly and other parts are defined intensionally by means of embedded calls to Web services, which can be invoked to gener...
متن کاملAn Effective Algorithm for XML Tree Pattern Matching and Pattern Tree Minimization
IJPRES Abstract— The extensible markup language XML has recently to come into read as a new standard for data representation and exchange on the internet. With XML becoming present language for data ability functions in varied domains, efficiently querying XML data is a critical issue. XML has become a follow normal to store, share and exchange business data across similar and dissimilar platfo...
متن کاملBenchmarking Holistic Approaches to XML Tree Pattern Query Processing - (Extended Abstract of Invited Talk)
In this talk I will outline and survey some developments in the field of XML tree pattern query processing, especially focussing on holistic approaches. XML tree pattern query (TPQ) processing is a research stream within XML data management that focuses on efficient TPQ answering. With the increasing popularity of XML for data representation, there is a lot of interest in query processing over ...
متن کاملAn efficient algorithm for tree pattern query minimization under broad integrity constraints
Purpose – Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are present and considered. Apparently, tree pattern minimization has great significance for efficient XML query processing. Although various minimization schemes/algorithms have been proposed, none of them can exploit broad ICs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JACIII
دوره 10 شماره
صفحات -
تاریخ انتشار 2006